On additive polynomials over a finite field
نویسندگان
چکیده
منابع مشابه
Defining Multiplication for Polynomials over a Finite Field
Let P and Q be two non-zero multiplicatively independent polynomials with coefficients in a finite field F. Adapting a result of R. Villemaire, we show that multiplication of polynomials is a ternary relation {(A,B,C) ∈ F[X] | A.B = C} definable by a first-order formula in a suitable structure containing both functions VP and VQ where VA(B) is defined as the greatest power of A dividing B. Such...
متن کاملSequences of Consecutive Smooth Polynomials over a Finite Field
Given ε > 0, we show that there are infinitely many sequences of consecutive εn-smooth polynomials over a finite field. The number of polynomials in each sequence is approximately ln ln lnn.
متن کاملRoots of sparse polynomials over a finite field
For a t-nomial f(x) = ∑t i=1 cix ai ∈ Fq[x], we show that the number of distinct, nonzero roots of f is bounded above by 2(q− 1)1−εCε, where ε = 1/(t− 1) and C is the size of the largest coset in Fq on which f vanishes completely. Additionally, we describe a number-theoretic parameter depending only on q and the exponents ai which provides a general and easily computable upper bound for C. We t...
متن کاملAdditive Polynomials over Perfect Fields
where aij ∈ K. Additive polynomials over valued fields in positive characteristic play an important role in understanding many algebraic and model theoretic properties of maximal fields of positive characteristic, see [7] for a thorough examination of the issue. A subset S of a valued field (K, v) has the optimal approximation property if for all a ∈ K, the set {v(s − a) : s ∈ S} has a maximal ...
متن کاملEnumerating all the Irreducible Polynomials over Finite Field
In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree n over a finite field and their roots in the extension field in quasilinear∗ time cost per element. Our algorithm is based on an improved algorithm for enumerating all the Lyndon words of length n in linear delay time and the known reduction of Lynd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 1999
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091500019970